Almost difference sets and their sequences with optimal autocorrelation

نویسندگان

  • K. T. Arasu
  • Cunsheng Ding
  • Tor Helleseth
  • P. Vijay Kumar
  • Halvard Martinsen
چکیده

Almost difference sets have interesting applications in cryptography and coding theory. In this paper, we give a wellrounded treatment of known families of almost difference sets, establish relations between some difference sets and some almost difference sets, and determine the numerical multiplier group of some families of almost difference sets. We also construct six new classes of almost difference sets, and four classes of binary sequences of period 0 (mod 4) with optimal autocorrelation. We have also obtained two classes of relative difference sets and four classes of divisible difference sets (DDSs). We also point out that a result due to Jungnickel can be used to construct almost difference sets and sequences of period 4 with optimal autocorrelation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a Class of Almost Difference Sets Constructed by Using the Ding-Helleseth-Martinsens Constructions

Pseudorandom binary sequences with optimal balance and autocorrelation have many applications in stream cipher, communication, coding theory, etc. It is known that binary sequences with three-level autocorrelation should have an almost difference set as their characteristic sets. How to construct new families of almost difference set is an important research topic in such fields as communicatio...

متن کامل

On the Nonexistence of the Ding-Helleseth-Martinsens Constructions of Almost Difference Set for Cyclotomic Classes of Order 6

Pseudorandom sequences with optimal three-level autocorrelation have important applications in CDMA communication systems. Constructing the sequences with three-level autocorrelation is equivalent to finding cyclic almost difference sets as their supports. In a paper of Ding, Helleseth, and Martinsen, the authors developed a new method known as the Ding-Helleseth-Martinsens Constructions in lit...

متن کامل

Several classes of binary sequences with three-level autocorrelation

In this correspondence we describe several classes of binary sequences with three-level autocorrelation. Those classes of binary sequences are based on cyclic almost difference sets. Some classes of binary sequences have optimum autocorrelation.

متن کامل

Almost p-Ary Perfect Sequences

A sequence a = (a0, a1, a2, · · · , an) is said to be an almost p-ary sequence of period n + 1 if a0 = 0 and ai = ζ bi p for 1 ≤ i ≤ n, where ζp is a primitive p-th root of unity and bi ∈ {0, 1, · · · , p − 1}. Such a sequence a is called perfect if all its out-of-phase autocorrelation coefficients are zero; and is called nearly perfect if its out-of-phase autocorrelation coefficients are all 1...

متن کامل

Nearly perfect sequences with arbitrary out-of-phase autocorrelation

In this paper we study nearly perfect sequences (NPS) via their connection to direct product difference sets (DPDS). We prove the connection between a p-ary NPS of period n and type γ and a cyclic (n, p, n, n−γ p + γ, 0, n−γ p )-DPDS for an arbitrary integer γ. Next, we present the necessary conditions for the existence of a p-ary NPS of type γ. We apply this result for excluding the existence ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2001